Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Identity based ring signature scheme in ideal lattice
SUN Yiru, LIANG Xiangqian, SHANG Yufang
Journal of Computer Applications    2016, 36 (7): 1861-1865.   DOI: 10.11772/j.issn.1001-9081.2016.07.1861
Abstract409)      PDF (889KB)(450)       Save
The existing signature schemes based on bi-linear pairings were proved to be insecure in quantum computing environment. A lattice has the features of simple computational operations and difficult problems on which are hard to solve. In order to resist the quantum attack, an identity based ring signature scheme was presented based on the assumption of the hardness of lattice problem-Small Integer Solution (SIS), and it was provably secure in the standard model by using the Ducas' ideal lattice technology (DUCAS L, MICCIANCIO D. Improved short lattice signatures in the standard model. Proceedings of the 34th Annual Cryptology Conference on Advances in Cryptology. Berlin:Springer, 2014:335-352). The scheme was mainly divided in to four steps:master key generation algorithm, the signature private key generation algorithm, signature algorithm and validation algorithm. The signature was output as a single vector. Compared to the same type signature schemes, to some extent, the proposed scheme shortens the length of private key, public key and the signature, improves the operation efficiency, in addition, it is also suitable for lightweight authentication, and the security of electronic commerce and cloud computing are indirectly ensured by the security of the signature algorithm.
Reference | Related Articles | Metrics